Generalising the simultaneous computation of the DFTs of two real sequences using a single N-point DFT
نویسندگان
چکیده
A general approach to the problem of simultaneous computation of the discrete Fourier transform (DFT) of two sequences of length N , which may be real, imaginary, conjugated symmetric or conjugated anti-symmetric, using a single N -point DFT of a complex sequence is presented. The framework developed is applied to the simultaneous computation of two DFTs, one DFT and one inverse DFT (IDFT) or two IDFTs for real N -point sequences. ? 2002 Published by Elsevier Science B.V.
منابع مشابه
Unified architecture for 2, 3, 4, 5, and 7-point DFTs based on Winograd Fourier transform algorithm
In this letter, a unified hardware architecture that can be reconfigured to calculate 2, 3, 4, 5, or 7-point DFTs is presented. The architecture is based on the Winograd Fourier transform algorithm (WFTA) and the complexity is equal to a 7-point DFT in terms of adders/subtracters and multipliers plus only seven multiplexers introduced to enable reconfigurability. The processing element finds po...
متن کاملEfficient Systolic Designs for 1- and 2-Dimensional DFT of General Transform-Lengths for High-Speed Wireless Communication Applications
In wireless communication, multiple receive-antennas are used with orthogonal frequency division multiplexing (OFDM) to improve the system capacity and performance. The discrete Fourier transform (DFT) plays an important part in such a system since the DFTs are required to be performed for the output of all those antennas separately. This paper presents area-time efficient systolic structures f...
متن کاملDatapath-regular implementation and scaled technique for N=3×2m DFTs
Discrete Fourier transform (DFT) is used widely in almost all fields of science and engineering, and is generally calculated using the fast Fourier transform (FFT) algorithm. In this paper, we present a fast algorithm for efficiently computing a DFT of size 3 2. The proposed algorithm decomposes the DFT, obtaining one length-2 unscaled sub-DFT and two length-2 sub-DFTs scaled by constant real n...
متن کاملA Fast Algorithm Based on SRFFT for Length N = q × 2 m DFTs
In this brief, we present a fast algorithm for computing length-q × 2 discrete Fourier transforms (DFT). The algorithm divides a DFT of size-N = q × 2 decimation in frequency into one length-N/2 DFT and two length-N/4 DFTs. The length-N/2 sub-DFT is recursively decomposed decimation in frequency, and the two size-N/4 sub-DFTs are transformed into two dimension and the terms with the same rotati...
متن کاملImplementing Fast Fourier Transform Algorithms of Real-Valued Sequences With the TMS320 DSP Platform
The Fast Fourier Transform (FFT) is an efficient computation of the Discrete Fourier Transform (DFT) and one of the most important tools used in digital signal processing applications. Because of its well-structured form, the FFT is a benchmark in assessing digital signal processor (DSP) performance. The development of FFT algorithms has assumed an input sequence consisting of complex numbers. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing
دوره 82 شماره
صفحات -
تاریخ انتشار 2002